Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM

• Papers • Previous Articles     Next Articles

A Dynamic Tree Structure of Wireless Sensor Networks

LIN Zhi-ting, QU Yu-gui, BAI Rong-gang, ZHAO Bao-hua   

  1. Department of Electronic Engineering and Information Science, University of
    Science and Technology of China, HeFei 230027, China
  • Received:2006-01-01 Revised:1900-01-01 Online:2006-05-30 Published:2006-05-30
  • Contact: LIN Zhi-ting
  • Supported by:
     

Abstract: Consisting nodes with limited battery power and wireless communication, sensor webs are deployed to collect useful information from a variety of environments. A new dynamic tree (D-tree) structure protocol based on the clustering protocol was proposed. It has significant impact on the overall energy depletion of the network. In D-tree protocol, most of the nodes communicate only with a close neighbor and incorporate data to reduce the amount of information to transmit to the cluster headers (CH). What should be emphasized is that the data generated by nodes won’t pass through the same route. They search for their multi-hop routing dynamically. The sensor nodes elect the CHs at regular intervals. Simulations show that D-tree can achieve a considerable reduction in energy dissipation compared with conventional routing protocols.

Key words: multi-hop, sensor network, cluster protocol, Dynamic-Tree

CLC Number: